Discrete Morse Theory on Join of Digraphs

Equivariant discrete Morse theory

In this paper, we study Forman's discrete Morse theory in the case where a group acts on the underlying complex. We generalize the notion of a Morse matching, and obtain a theory that can be used to simplify the description of the G-homotopy type of a simplicial complex. As an application, we determine the C2 × Sn−2-homotopy type of the complex of non-connected graphs on n nodes.

Persistence in discrete Morse theory

Discrete Morse Theory for Filtrations

Acknowledgements Enumerating all the ways in which I am grateful to Konstantin would essentially double the length of this document, so I'll save all that stuff for my autobiography. But I will note here that he was simultaneously patient, engaged, proactive, and – best of all – ruthlessly determined to refine and sculpt all our vague big-picture ideas into digestible and implementable concrete...

Discrete Morse Theory and Localization

Incidence relations among the cells of a regular CW complex produce a 2category of entrance paths whose classifying space is homotopy-equivalent to that complex. We show here that each acyclic partial matching on (the cells of) such a complex corresponds precisely to a homotopy-preserving localization of the associated entrance path category. Restricting attention further to the full localized ...

Birth and death in discrete Morse theory

SupposeM is a finite simplicial complex and that for 0 = t0, t1, . . . , tr = 1 we have a discrete Morse function Fti : M → R. In this paper, we study the births and deaths of critical cells for the functions Fti and present an algorithm for pairing the cells that occur in adjacent slices. We first study the case where the triangulation of M is the same for each ti, and then generalize to the c...